An adaptive residual sub-sampling algorithm for kernel interpolation based on maximum likelihood estimations

نویسندگان

چکیده

In this paper we propose an enhanced version of the residual sub-sampling method (RSM) in Driscoll and Heryudono (2007) for adaptive interpolation by radial basis functions (RBFs). More precisely, introduce context methods a maximum profile likelihood estimation (MPLE) criterion optimal selection RBF shape parameter. This choice is completely automatic, provides highly reliable accurate results any RBFs, and, unlike original RSM, guarantees that interpolant exists uniquely. The efficacy new method, called MPLE-RSM, tested numerical experiments on some 1D 2D benchmark target functions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An adaptive maximum-likelihood deconvolution algorithm

Kormylo and Mendel proposed a maximum-likelihood deconvolution (MLD) algorithm for estimating a desired sparse spike sequence p.(k), modelled as a Bernoulli-Gaussian (B-G) signal, which was distorted by a linear time-invariant system v(k). Then Chi, Mendel and Hampson proposed another MLD algorithm which is a computationally fast MLD algorithm and has been successfully used to process real seis...

متن کامل

AN ADAPTIVE IMPORTANCE SAMPLING-BASED ALGORITHM USING THE FIRST-ORDER METHOD FOR STRUCTURAL RELIABILITY

Monte Carlo simulation (MCS) is a useful tool for computation of probability of failure in reliability analysis. However, the large number of samples, often required for acceptable accuracy, makes it time-consuming. Importance sampling is a method on the basis of MCS which has been proposed to reduce the computational time of MCS. In this paper, a new adaptive importance sampling-based algorith...

متن کامل

Linguistic tree based maximum likelihood model interpolation

In this paper, a speaker adaptation method is presented which computes the speaker adapted model by a weighted sum of a set of speaker dependent models. The set of weights are estimated to maximize the likelihood of the adaptation data. Then a linguistic tree is constructed to cluster the mean vectors. The means in the same linguistic class share the same weight set, while the means in differen...

متن کامل

Computationally scalable adaptive image interpolation algorithm using maximum-likelihood denoising for real-time applications

Computationally scalable image interpolation algorithm is always desirable for software and hardware implementations on center processing unit (CPU), digital signal processor, field-programmable gate array, and low-cost hardware. A low-complexity, computationally scalable, and data-adaptive image interpolation algorithm that has a simple and homogeneous structure to efficiently scale the comput...

متن کامل

Maximum Kernel Likelihood Estimation

We introduce an estimator for the population mean based on maximizing likelihoods formed by parameterizing a kernel density estimate. Due to these origins, we have dubbed the estimator the maximum kernel likelihood estimate (mkle). A speedy computational method to compute the mkle based on binning is implemented in a simulation study which shows that the mkle at an optimal bandwidth is decidedl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2023

ISSN: ['0377-0427', '1879-1778', '0771-050X']

DOI: https://doi.org/10.1016/j.cam.2022.114658